How to Reason Credulously and Skeptically within a Single Extension
نویسندگان
چکیده
Consistency-based approaches in nonmonotonic reasoning may be expected to yield multiple sets of default conclusions for a given default theory. Reasoning about such extensions is carried out at the meta-level. In this paper, we show how such reasoning may be carried out at the object level for a large class of default theories. Essentially we show how one can translate a (normal) default theory∆, obtaining a second∆′, such that∆′ has a single extension that encodes every extension of ∆. Moreover, our translated theory is only a constant factor larger than the original (with the exception of unique names axioms). We prove that our translation behaves correctly. In the approach we can now encode the notion of extension from within the framework of standard default logic. Hence one can encode notions such as skeptical and credulous conclusions, and can reason about such conclusions within a single extension. This result has some theoretical interest, in that it shows how multiple extensions of normal default theories are encodable with manageable overhead in a single extension.
منابع مشابه
Reasoning Credulously and skeptically within a single extension
Consistency-based approaches in nonmonotonic reasoning may be expected to yield multiple sets of default conclusions for a given default theory. Reasoning about such extensions is carried out at the meta-level. In this paper, we show how such reasoning may be carried out at the object level for a large class of default theories. Essentially we show how one can translate a (semi-monotonic) defau...
متن کاملSystem Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15)
LabSAT is a solver for computing several reasoning tasks in abstract argumentation frameworks. It enumerates extensions of the complete, preferred, stable and grounded semantics. Further, LabSAT solves the problem of deciding credulously and skeptically. The solver utilizes the labelling approach by Caminada and translates it into a boolean satisfiability problem (SAT).
متن کاملComplexity of semi-stable and stage semantics in argumentation frameworks
In this work, we answer two questions about the complexity of semi-stable semantics for abstract argumentation frameworks: we show Π2 -completeness for the problem of deciding whether an argument is skeptically accepted, and respectively, ΣP2 completeness for the problem of deciding whether an argument is credulously accepted under the semi-stable semantics. Furthermore, we extend these complex...
متن کاملA Two-Phase Dialogue Game for Skeptical Preferred Semantics
In this paper we propose a labelling based dialogue game for determining whether a single argument within a Dung argumentation framework is skeptically preferred. Our game consists of two phases, and determines the membership of a single argument within the extension, assuming optimal play by dialogue participants. In the first phase, one player attempts to advance arguments to construct an ext...
متن کاملDP — A System for Reasoning with Supernormal Defaults
DP is a top-down theorem prover for supernormal or Poole-type defaults. Axioms and defaults can be arbitrary clauses, i.e. it supports disjunctions and (real) classical negation. Multiple disjunctions can be handled credulously, skeptically, and carefully. In skeptical mode, the expressivity of supernormal defaults corresponds to variable circumscription. The system is based on model eliminatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001